On the Hardness of Devising Interval Routing Schemes
نویسنده
چکیده
The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complete. This is the rst hardness result for k-IRS where k is constant and the graph underlying the network is unweighted. Moreover, the NP-completeness holds also for linear and strict 2-IRS.
منابع مشابه
On the hardness of minimizing space for all-shortest-path interval routing schemes
k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc; and global k-IRS allows not more than a total of k interval labels in the whole network. A fundamental problem is to characterize the networks that admit k-IRS (or global k-IRS). Many of the problems related to single-shortest-path k-IRS have already been shown to be NP-co...
متن کاملEnhanced chromosome repairing mechanism based genetic algorithm approach for the multi-period perishable production inventory-routing problem
One of the important aspects of distribution optimization problems is simultaneously, controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (IRP). When the lot-sizing decisions are jointed with IRP, the problem will get more complicated called production inventory-routing problem (PIRP). To become closer to the real life p...
متن کاملToward a General Theory of Unicast-Based Multicast Communication
Multicast, also known as one-to-many communication, is the problem of sending a message from a single source node to several destination nodes. In this paper, we study the problem of implementing multicasts via a technique called Unicast-Based Multicast (UBM). In particular, we focus on the problem of nding optimal UBM calling schedules for arbitrary topologies using restricted inclusive routin...
متن کاملLinear Interval Routing
We study a variant of Interval Routing SK85, LT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap around. This kind of routing schemes arises naturally in the study of dynamic Preex Routing BLT90]. Linear Interval Routing schemes are precisely the Preex Routing schemes that use an alphabet of one symbol. We characterize the...
متن کاملCompact Routing on Chordal Rings of Degree Four yLata
A chordal ring G(n; c) of degree 4 is a ring of n nodes with chords connecting each vertex i to the vertex (i + c) mod n. In this paper, we investigate compact routing schemes on such networks. We show a routing scheme for any such network that requires O(log n) bits of storage at each node, and O(1) time to compute a shortest path to any destination. This improves on the results of 16] which g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 7 شماره
صفحات -
تاریخ انتشار 1997